DUAL SPACE OF THE SPACE OF BOUNDED LINEAR n−FUNCTIONALS
نویسندگان
چکیده
منابع مشابه
Truncated Linear Minimax Estimator of a Power of the Scale Parameter in a Lower- Bounded Parameter Space
Minimax estimation problems with restricted parameter space reached increasing interest within the last two decades Some authors derived minimax and admissible estimators of bounded parameters under squared error loss and scale invariant squared error loss In some truncated estimation problems the most natural estimator to be considered is the truncated version of a classic...
متن کاملComplex Banach Space of Bounded Linear Operators
Let X be a set, let Y be a non empty set, let F be a function from [: C, Y :] into Y , let c be a complex number, and let f be a function from X into Y . Then F ◦(c, f) is an element of Y X . We now state the proposition (1) Let X be a non empty set and Y be a complex linear space. Then there exists a function M1 from [: C, (the carrier of Y ) X :] into (the carrier of Y ) such that for every C...
متن کاملBanach Space of Bounded Linear Operators
Let X be a set, let Y be a non empty set, let F be a function from [: R, Y :] into Y , let a be a real number, and let f be a function from X into Y . Then F ◦(a, f) is an element of Y X . One can prove the following propositions: (1) Let X be a non empty set and Y be a non empty loop structure. Then there exists a binary operation A1 on (the carrier of Y ) X such that for all elements f , g of...
متن کاملGRADUAL NORMED LINEAR SPACE
In this paper, the gradual real numbers are considered and the notion of the gradual normed linear space is given. Also some topological properties of such spaces are studied, and it is shown that the gradual normed linear space is a locally convex space, in classical sense. So the results in locally convex spaces can be translated in gradual normed linear spaces. Finally, we give an examp...
متن کاملBounded Treewidth and Space-Efficient Linear Algebra
Motivated by a recent result of Elberfeld, Jakoby and Tantau[EJT10] showing that MSO properties are Logspace computable on graphs of bounded tree-width, we consider the complexity of computing the determinant of the adjacency matrix of a bounded tree-width graph and as our main result prove that it is in Logspace. It is important to notice that the determinant is neither an MSO-property nor cou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Математички билтен/BULLETIN MATHÉMATIQUE DE LA SOCIÉTÉ DES MATHÉMATICIENS DE LA RÉPUBLIQUE MACÉDOINE
سال: 2012
ISSN: 0351-336X,1857-9914
DOI: 10.37560/matbil123600047m